On CRDTs in Byzantine Environments
In a Byzantine peer-to-peer system, other nodes are actively trying to attack the system. It has been noted by Martin Kleppmann, that replicated data types are already well positioned to deal with such attacks, by recording a history of all operations, and protecting the history with cryptographic checksums. This is the concept underlying the Matrix protocol – so the concept works – but does it generalize to other replicated data types?